Scheduling UET-UCT Series-Parallel Graphs on Two Processors
نویسندگان
چکیده
The scheduling of task graphs on two identical processors is considered. It is assumed that tasks have unit-execution-time, and arcs are associated with unit-communication-time delays. The problem is to assign the tasks to the two processors and schedule their execution in order to minimize the makespan. A quadratic algorithm is proposed to compute an optimal schedule for a class of series-parallel graphs, called SP1 graphs, which includes in particular in-forests and out-forests.
منابع مشابه
Scheduling UET, UCT dags with release dates and deadlines
The problem of scheduling precedence graphs for which every task has to be executed in a non-uniform interval is considered, with interprocessor communication delays. For the following classes of graphs we will present a polynomial time algorithm that nds minimumlateness schedules. 1. Outforests on two processors. 2. Series-parallel graphs and opposing forests with the least urgent parent prope...
متن کاملOptimal Scheduling for UET-UCT Generalized n-Dimensional Grid Task Graphs
= Partially supported by the Greek Secretariat of Research and Technology (GSRT) under the PENED/1405 project. Abstract The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution unit communication time (UET-UCT). In this paper we enhance the model of ndimensional grid by addi...
متن کاملOptimal scheduling for UET-UCT grids into fixed number of processors
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. Many scientific algorithms, which require nearest neighbor communication in a lattice space, are modeled by a task graph with the properties of a simple or enhanced grid. In this paper we consider an enhanced model of the ndimensional grid by adding extra diagonal edges and allowing unequal b...
متن کاملOptimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors
The problem of scheduling a set of n unit execution time (UET) tasks subject to precedence constraints on m identical parallel processors is known to be N P -hard in the strong sense. However, polynomial time algorithms exist for some classes of precedence graphs. In this paper, we consider a class of divide-and-conquer graphs that naturally models the execution of the recursive control abstrac...
متن کاملOn the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
We consider the unit execution time unit communication time (UET-UCT) schedulingmodelwith hierarchical communications [1], and we study the impact of the hierarchical communications hypothesis on the hardness of approximation. We prove that there is no polynomial time approximation algorithm with performance guarantee smaller than 5/4 (unless P = NP). This result is an extension of the result o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 162 شماره
صفحات -
تاریخ انتشار 1996